////用两个栈实现一个队列。队列的声明如下，请实现它的两个函数 appendTail 和 deleteHead ，分别完成在队列尾部插入整数和在队列头部删除整数的
////功能。(若队列中没有元素，deleteHead 操作返回 -1 )
////
////
////
//// 示例 1：
////
//// 输入：
////["CQueue","appendTail","deleteHead","deleteHead"]
////[[],[3],[],[]]
////输出：[null,null,3,-1]
////
////
//// 示例 2：
////
//// 输入：
////["CQueue","deleteHead","appendTail","appendTail","deleteHead","deleteHead"]
////[[],[],[5],[2],[],[]]
////输出：[null,-1,null,null,5,2]
////
////
//// 提示：
////
////
//// 1 <= values <= 10000
//// 最多会对 appendTail、deleteHead 进行 10000 次调用
////
//// Related Topics 栈 设计 队列
//// 👍 296 👎 0
//
///**
// * @author DaHuangXiao
// */
//package leetcode.editor.cn;
//
//import java.util.LinkedList;
//
//public class YongLiangGeZhanShiXianDuiLieLcof {
//    public static void main(String[] args) {
//        Solution solution = new YongLiangGeZhanShiXianDuiLieLcof().new Solution();
//    }
//    //leetcode submit region begin(Prohibit modification and deletion)
//class CQueue {
//    private LinkedList<Integer> stackA;
//    private LinkedList<Integer> stackB;
//    public CQueue() {
//        stackA = new LinkedList<>();
//        stackB = new LinkedList<>();
//    }
//
//    public void appendTail(int value) {
//        stackA.addLast(value);
//    }
//
//    public int deleteHead() {
//        if (!stackB.isEmpty()){return stackB.pollLast();}
//        if (stackA.isEmpty()){return -1;}
//        while (!stackA.isEmpty()){stackB.addLast(stackA.pollLast());}
//        return stackB.pollLast();
//    }
//}
//
///**
// * Your CQueue object will be instantiated and called as such:
// * CQueue obj = new CQueue();
// * obj.appendTail(value);
// * int param_2 = obj.deleteHead();
// */
////leetcode submit region end(Prohibit modification and deletion)
//
//}